On 2-closed abelian permutation groups
نویسندگان
چکیده
A permutation group G?Sym(?) is said to be 2-closed if no H such that G<H?Sym(?) has the same orbits on ?×? as G. simple and efficient inductive criterion for 2-closedness established abelian groups with cyclic transitive constituents.
منابع مشابه
Cycle-Closed Permutation Groups
A finite permutation group is cycle-closed if it contains all the cycles of all of its elements. It is shown by elementary means that the cycle-closed groups are precisely the direct products of symmetric groups and cyclic groups of prime order. Moreover, from any group, a cycle-closed group is reached in at most three steps, a step consisting of adding all cycles of all group elements. For inf...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملPseudorandom Permutation Families over Abelian Groups
We propose a general framework for differential and linear cryptanalysis of block ciphers when the block is not a bitstring. We prove piling-up lemmas for the generalized differential probability and the linear potential, and we study their lower bounds and average value, in particular in the case of permutations of Fp. Using this framework, we describe a toy cipher, that operates on blocks of ...
متن کاملOn a Permutation Problem for Finite Abelian Groups
LetG be a finite additive abelian group with exponent n > 1, and let a1, . . . , an−1 be elements of G. We show that there is a permutation σ ∈ Sn−1 such that all the elements saσ(s) (s = 1, . . . , n− 1) are nonzero if and only if ∣∣∣{1 6 s < n : n d as 6= 0 }∣∣∣ > d− 1 for every positive divisor d of n. When G is the cyclic group Z/nZ, this confirms a conjecture of Z.-W. Sun.
متن کاملSynchronization 2: Permutation groups
Notation Ω will denote a set (often the set The image of an element v ∈ Ω under a permutation g of Ω will be denoted by vg. So if g and h are permutations, and we define composition by the rule that gh means " apply g, then h " , then v(gh) = (vg)h.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2021
ISSN: ['1532-4125', '0092-7872']
DOI: https://doi.org/10.1080/00927872.2021.1990307